Edge Fusion Algorithm for Orthogonal Projection of Multiple Overlapping Regions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast randomized algorithm for orthogonal projection

We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A, provided that both A and its adjoint A can be applied rapidly to arbitrary vectors. As an intermediate step, the algorithm solves the overdetermined linear l...

متن کامل

A Forward-Backward Projection Algorithm for Approximating of the Zero of the ‎S‎um of ‎T‎wo Operators

‎I‎n this paper‎, ‎a‎ forward-‎b‎ackward projection algorithm is considered for finding zero points of the sum of two operators‎ ‎in Hilbert spaces‎. ‎The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly‎ ‎monotone operator and a maximal monotone operator‎. ‎We apply the result for solving the variational inequality problem, fixed po...

متن کامل

Computing Multiple-Output Regression Quantile Regions from Projection Quantiles

In the multiple-output regression context, Hallin, Paindaveine and Šiman (2010) introduced a powerful data-analytical tool based on regression quantile regions. However, the computation of these regions, that are obtained by considering in all directions an original concept of directional regression quantiles, is a very challenging problem. Paindaveine and Šiman (2010b) described a first elegan...

متن کامل

Orthogonal Margin Maximization Projection for Gait Recognition

An efficient supervised orthogonal nonlinear dimensionality reduction algorithm, namely orthogonal margin maximization projection (OMMP), is presented for gait recognition in this paper. Taking the local neighborhood geometry structure and class information into account, the proposed algorithm aims to find a projecting matrix by maximizing the local neighborhood margin between the different cla...

متن کامل

Orthogonal Approximately Harmonic Projection for Face Recognition

Face recognition has attracted growing attention for applications such as identity authentication and human-computer interface. However, a major challenge of face recognition is that the captured face image often lies in a high-dimensional feature space. To overcome the curse of dimensionality problem and improve the performance of face recognition, a novel manifold learning algorithm called or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DEStech Transactions on Computer Science and Engineering

سال: 2019

ISSN: 2475-8841

DOI: 10.12783/dtcse/iteee2019/28724